Homotopy and continuous reachability
نویسندگان
چکیده
منابع مشابه
Reachability for Continuous and Hybrid Systems
In this talk I present some past, present and future work concerning reachability computation for continuous and hybrid systems. The problem of what may happen in the future is very naturally phrased as a reachability problem in a dynamical system. Starting from an initial state or a set of states, following some dynamic rules, possibly with some dose of uncertainty, we would like to know wheth...
متن کاملVerified Reachability Analysis of Continuous Systems
Ordinary differential equations (ODEs) are often used to model the dynamics of (often safety-critical) continuous systems. This work presents the formal verification of an algorithm for reachability analysis in continuous systems. The algorithm features adaptive RungeKutta methods and rigorous numerics based on affine arithmetic. It is proved to be sound with respect to the existing formalizati...
متن کاملFractional Positive Continuous-Time Linear Systems and Their Reachability
In positive systems, inputs, state variables and outputs take only nonnegative values. Examples of positive systems are industrial processes involving chemical reactors, heat exchangers and distillation columns, storage systems, compartmental systems, water and atmospheric pollution models. A variety of models behaving as positive linear systems can be found in engineering, management science, ...
متن کاملContinuous and discrete homotopy operators: A theoretical approach made concrete
Using standard calculus, explicit formulas for the one-dimensional continuous and discrete homotopy operators are derived. It is shown that these formulas are equivalent to those in terms of Euler operators obtained from the variational complex. The continuous homotopy operator automates integration by parts on the jet space. Its discrete analogue can be used in applications where summation by ...
متن کاملTime-Bounded Reachability in Continuous-Time Markov Decision Processes
This paper solves the problem of computing the maximum and minimum probability to reach a set of goal states within a given time bound for locally uniform continuous-time Markov decision processes (CTMDPs). As this model allows for nondeterministic choices between exponentially delayed transitions, we define total time positional (TTP) schedulers which rely on the CTMDP’s current state and the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology
سال: 1976
ISSN: 0040-9383
DOI: 10.1016/0040-9383(76)90050-1